Guessing the Number of Vibhītaka Seeds

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Number-Guessing Game

On the TV show “The Price Is Right,” a player tries to win a new car by guessing its price. The price consists of a known number of digits (usually 5). Possibilities (hints) for each digit are revealed to the player. If the player fails to guess at least one correct digit in its correct place during a turn, the player loses. A player who eventually guesses all digits correctly wins the car. For...

متن کامل

The Guessing Number of Undirected Graphs

Riis [Electron. J. Combin., 14(1):R44, 2007] introduced a guessing game for graphs which is equivalent to finding protocols for network coding. In this paper we prove upper and lower bounds for the winning probability of the guessing game on undirected graphs. We find optimal bounds for perfect graphs and minimally imperfect graphs, and present a conjecture relating the exact value for all grap...

متن کامل

The linear guessing number of undirected graphs

Article history: Received 15 January 2013 Accepted 5 February 2014 Available online xxxx Submitted by R. Brualdi MSC: 05C72 05C57 68R10 94A99

متن کامل

I’ve got your number: a multiple choice guessing game

We consider the following guessing game: fix positive integers k, m, and n. Player A (“Ann”) chooses a (uniformly) random integer α from the set {1,2,3, . . . ,n}, but does not reveal α to Player B (“Gus”). Gus then presents Ann with a k-option multiple choice question about which number she chose, to which Ann responds truthfully. After m such questions have been asked, Gus must attempt to gue...

متن کامل

Guessing and non-guessing of canonical functions

It is possible to control to a large extent, via semiproper forcing, the parameters (β0, β1) measuring the guessing density of the members of any given antichain of stationary subsets of ω1 (assuming the existence of an inaccessible limit of measurable cardinals). Here, given a pair (β0, β1) of ordinals, we will say that a stationary set S ⊆ ω1 has guessing density (β0, β1) if β0 = γ(S) and β1 ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Royal Asiatic Society of Great Britain & Ireland

سال: 1904

ISSN: 0035-869X,2051-2066

DOI: 10.1017/s0035869x00031907